Multi-way Monte Carlo Method for Linear Systems

We study the Monte Carlo method for solving a linear system of the form x = Hx + b. A sufficient condition for the method to work is ‖H‖ < 1, which greatly limits the usability of this method. We improve this condition by proposing a new multi-way Markov random walk, which is a generalization of the standard Markov random walk. Under our new framework we prove that the necessary and sufficient condition for our method to work is the spectral radius ρ(H) < 1, which is a weaker requirement than ‖H‖ < 1. In addition to solving more problems, our new method can work faster than the standard algorithm. In numerical experiments on both synthetic and real world matrices, we demonstrate the effectiveness of our new method. ar X iv :1 60 8. 04 36 1v 1 [ cs .N A ] 1 5 A ug 2 01 6